Electronic Communications of the EASST
نویسندگان
چکیده
In this paper we present a fully symbolic TCTL model checking algorithm for incomplete timed systems. Our algorithm is able to prove that a TCTL property is violated or satisfied regardless of the implementation of unknown timed components in the system. For that purpose the algorithm computes overapproximations of sets of states fulfilling a TCTL property φ for at least one implementation of the unknown components and under-approximations of sets of states fulfilling φ for all possible implementations of the unknown components. The algorithm works on a symbolic model for timed systems, called a finite state machine with time (FSMT), and makes use of fully symbolic state set representations containing both the clock values and the state variables. In order to handle incomplete timed systems our model checking algorithm deals with different communication methods between the system and its unknown components, e.g. shared integer variables and urgent and non-urgent synchronization. Our experimental results demonstrate that it is possible to prove interesting properties at early stages of the design when parts of the overall system may not yet be finished. Additionally, fading out components of a large system may dramatically reduce the complexity of the system and thus the effort for verification.
منابع مشابه
Electronic Communications of the EASST Volume ( FMIS 09 Preliminary Proceedings
Emotion and trust are two important concerns for the elaboration of interaction systems that would be closer and more attractive to their users, in particular by endowing machines with the ability to predict, understand, and process emotions and trust. This paper attempts to construct a common logical framework for the representation of emotion and trust. This logical framework combines a logic...
متن کاملAn Empirical Study on EDI Diffusion in the Iranian Maritime Trade
Electronic Data Interchange (EDI) is commonly defined as an application-to-application transfer of business documents between computers using industry-defined standards which enable organizations to send and receive business communications more quickly, flexibly, cheaply, and with higher security than conventional communications. With improvements in the quality and affordability of data commun...
متن کاملElectronic Communications of the EASST Volume 23 ( 2009 ) Proceedings of the Ninth International Workshop on Automated Verification of Critical Systems ( AVOCS 2009 ) Mobile CSP ‖
CSP‖B is a combination of CSP and B in which CSP processes are used as control executives for B machines. This architecture enables a B machine and its controller to interact and communicate with each other while working in parallel. The architecture has focused on sequential CSP processes as dedicated controllers for B machines. This paper introduces Mobile CSP‖B, a formal framework based on C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014